Critical Lengths of Error Events in Convolutional Codes

Critical Lengths of Error Events in Convolutional Codes

If the calculation of the critical length is based on the expurgated exponent, the length becomes nonzero for low error probabilities. This result applies to typical long codes, but it may also be useful for modeling error events in specific codes.

Critical Lengths of Error Events in Convolutional Codes

A State-Reduction Viterbi Decoder for Convolutional Codes with Large Constraint Lengths

A popular combination in modern coding system is the convolutional encoder and the Viterbi decoder [5]. With a proper design, they can jointly provide an acceptable performance with feasible decoding complexity. In such a combination, a tradeoff on the error performance and the decoding complexity resides on the choice of the code constraint length. Specifically, the probability of Viterbi deco...

Packet error rates of terminated and tailbiting convolutional codes

When a convolutional code is used to provide forward error correction for packet data transmission, the standard performance measures of convolutional codes, i.e., bit error rate and first-event error rate, become less useful. Instead we are interested in the average probability of block (or packet) error. In this paper a modified transfer function approach is used to obtain a union bound on th...

On the Performance of Short Tail-Biting Convolutional Codes for Ultra-Reliable Communications

Motivated by the increasing interest in powerful short channel codes for low-latency ultra-reliable communications, we analyze the performance of tail-biting convolutional codes with different memories, block lengths and code rates over the additive white Gaussian noise channel. The analysis is carried out both through Monte Carlo simulations and by upper bounding the error probability via Polt...